package com.lsa.letcode.the27.removeEl;

public class Solution {
    public int removeElement(int[] arr, int e) {
    	int cur = -1;
    	for (int i = 0; i < arr.length; i++) {
			if (e != arr[i]) {
				arr[++cur] = arr[i];
			}
		}
        return cur + 1;
    }
}